On-the-fly Emptiness Check of Transition-Based Streett Automata

In the automata theoretic approach to model checking, checking a state-space S against a linear-time property φ can be done in O(|S| × 2) time. When model checking under n strong fairness hypotheses expressed as a Generalized Büchi automaton, this complexity becomes O(|S| × 2). Here we describe an algorithm to check the emptiness of Streett automata, which allows model checking under n strong fairness hypotheses in O(|S| × 2 × n). We focus on transition-based Streett automata, because it allows us to express strong fairness hypotheses by injecting Streett acceptance conditions into the state-space without any blowup.